Meminimalkan Sisa Pemotongan Besi Beton dalam Proyek Konstruksi

Authors

  • Bambang Santoso Pamulang University
  • Sofyan Mufti Prasetiyo Universitas Pamulang
  • Agung Wijoyo Universitas Pamulang

DOI:

https://doi.org/10.32493/informatika.v4i2.3204

Keywords:

minimize waste, greedy search, optimized solution, construction project, cutting stock problems

Abstract

Construction industries are a must in developing countries. Constructions take part in almost every corner of the country. In construction projects, reinforced concrete plays big part in any construction. A long bar of steel are cut into be several lengths to satisfy the requirements of the buildings to be build. In this process, waste cannot be avoided. And the waste of steel bar is very destructive to environment. This research is to find a way to minimize the waste in the process of cutting steel bars. The algorithm used is Greedy Search. Greedy Search is where the optimized solution in every step is taken, in the hope that the overall solution will be optimized for the problem. Optimized solution here is the minimum waste by the steel bar cutting. This will minimize the cost by the construction companies and at the same time preserve the environment.

References

Abuhassan, I. A. O., & Nasereddin, H. H. O. (2011). Cutting Stock Problem?: Solution Behaviors. 6(4), 429–433. Retrieved from https://www.researchgate.net/publication/281120697_CUTTING_STOCK_PROBLEM_SOLUTION_BEHAVIORS

Brualdi, R. A. (2010). Introductory Combinatorics. In Pearson Education, Inc. https://doi.org/10.2307/2320280

Feo, T. A., & Resende, M. G. C. (1995). Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6(2), 109–134. https://doi.org/10.1007/BF01096763

Guichard, D. (2018). An Introduction to Combinatorics and Graph. Creative Commons.

Kirch-prinz, U., & Prinz, P. (2002). A Complete Guide to Programming in C++ (1st ed.). Sudbury, MA: Jones And Bartlett Publishers.

Malik, A., Sharma, A., & Saroha, V. (2013). Greedy Algorithm. International Journal of Scientific and Research Publications, 3(8), 1–4. Retrieved from http://xlinux.nist.gov/dads//HTML/greedyalgo.html

Subhadra, A. (2016). Greedy Algorithms: Analysis, Design & Applications. International Journal of Informative & Futuristic Research, 3(5), 1749–1764.

Wilt, C., Thayer, J., & Ruml, W. (2010). A comparison of greedy search algorithms. Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010, (July 2010), 129–136.

Downloads

Published

2019-06-30

Issue

Vol. 4 No. 2 (2019): JURNAL INFORMATIKA UNIVERSITAS PAMULANG

Section

Article

License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

Jurnal Informatika Universitas Pamulang have CC-BY-NC or an equivalent license as the optimal license for the publication, distribution, use, and reuse of scholarly work.

In developing strategy and setting priorities, Jurnal Informatika Universitas Pamulang recognize that free access is better than priced access, libre access is better than free access, and libre under CC-BY-NC or the equivalent is better than libre under more restrictive open licenses. We should achieve what we can when we can. We should not delay achieving free in order to achieve libre, and we should not stop with free when we can achieve libre.

Jurnal Informatika Universitas Pamulang is licensed under a Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)

YOU ARE FREE TO:

  • Adapt : remix, transform, and build upon the material for any purpose, even commercially.
  • The licensor cannot revoke these freedoms as long as you follow the license terms